package algorithms.question.class23;

/**
 * https://leetcode-cn.com/problems/minimum-cost-to-merge-stones/
 *
 * @author guichang
 * @date 2021/8/30
 */

public class Code5_合并石头的最低成本 {
    // L-R范围内K个数一组合出P个数的最小代价
    // f(arr,L,R,K,P)
}